Partition congruences by involutions

Partition congruences by involutions

We present a general construction of involutions on integer partitions which enable us to prove a number of modulo 2 partition congruences. Introduction The theory of partitions is a beautiful subject introduced by Euler over 250 years ago and is still under intense development [2]. Arguably, a turning point in its history was the invention of the “constructive partition theory” symbolized by F...

Identities from Partition Involutions

Subbarao and Andrews have observed that the combinatorial technique used by F. Franklin to prove Eulers famous partition identity (l-x)(l-x)(l-x)(l-x*) ••• = 1-x-x +x +x -x -x + ••• can be applied to prove the more general formula l-x-xy(l-xy) -xy(±-xy)(±-xy) xy (1 xy) (1 xy) (1 xy) = 1 -x-xy+xy+xy -xy -xy + • •• which reduces to Eulers when y = 1. This note shows that several finite versions o...

Square - Partition Congruences

Partition identities arising from involutions

We give a simple combinatorial proof of three identities of Warnaar. The proofs exploit involutions due to Franklin and Schur.

Congruences of the Partition Function

Ramanujan also conjectured that congruences (1) exist for the cases A = 5 , 7 , or 11 . This conjecture was proved by Watson [17] for the cases of powers of 5 and 7 and Atkin [3] for the cases of powers of 11. Since then, the problem of finding more examples of such congruences has attracted a great deal of attention. However, Ramanujan-type congruences appear to be very sparse. Prior to the la...